منابع مشابه
Exact real arithmetic using centred intervals and bounded error terms
Approximations based on dyadic centred intervals are investigated as a means for implementing exact real arithmetic. It is shown that the field operations can be implemented on these approximations with optimal or near optimal results. Bounds for the loss in quality of approximations for each of the field operations are also given. These approximations can be used as a more efficient alternativ...
متن کاملBounded Orbits Conjecture and Diophantine Approximation
We describe and generalize S.G. Dani’s correspondence between bounded orbits in the space of lattices and systems of linear forms with certain Diophantine properties. The solution to Margulis’ Bounded Orbit Conjecture is used to generalize W. Schmidt’s theorem on abundance of badly approximable systems of linear forms.
متن کاملInhomogeneous Diophantine approximation with general error functions
Let α be an irrational and φ : N → R be a function decreasing to zero. For any α with a given Diophantine type, we show some sharp estimations for the Hausdorff dimension of the set Eφ(α) := {y ∈ R : ‖nα− y‖ < φ(n) for infinitely many n}, where ‖ · ‖ denotes the distance to the nearest integer.
متن کاملMore Metanilpotent Fitting Classes with Bounded Chief Factor Ranks
Metanilpotent Fitting classes are given consisting of groups with elementary abelian Fitting quotient and fairly wide choices of the nilpotency class of the nilpotent residual. Many of the minimal normal subgroups are non-central. AMS subject classiication 20D10 1 Key sections The aim of this note is to establish further examples of Fitting classes of metanilpotent groups to further the transpa...
متن کاملPolyline Simpliication Using Quadric Error Metric with Bounded Error Polyline Simpliication Using Quadric Error Metric with Bounded Error Polyline Simpliication Using Quadric Error Metric with Bounded Error
We study the problem of polygonal line simpliication. The objective is to seek a polygonal line of smaller size that approximates the original one well. We present an algorithm that is based on edge contraction. An edge contraction merges two adjacent vertices into a new vertex and this new vertex will be made the new endpoint of the uncontracted edges incident to the two vertices merged. Thus,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Research Letters
سال: 2019
ISSN: 1073-2780,1945-001X
DOI: 10.4310/mrl.2019.v26.n5.a14